Parallelogram Polyominoes and Corners
نویسندگان
چکیده
(Received) We give an equation satissed by the generating function for parallelogram polyominoes according to the area, the width and the number of left path corners. Next, we give an explicit formula for the generating function of these polyominoes according to the area, the width and the number of right and left paths corners.
منابع مشابه
Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled
We provide a new succession rule (i.e. generating tree) associated with Schröder numbers, that interpolates between the known succession rules for Catalan and Baxter numbers. We define Schröder and Baxter generalizations of parallelogram polyominoes (called slicings) which grow according to these succession rules. We also exhibit Schröder subclasses of Baxter classes, namely a Schröder subset o...
متن کاملCombinatorics of labelled parallelogram polyominoes
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by northeast lattice paths going from the origin to a point (k, n). The numbers from 1 to n (the labels) are bijectively attached to the n north steps of the above-bounding path, with the condition that they appear in increasing values along consecu...
متن کاملCounting Directed-convex Polyominoes According to Their Perimeter
An approach is presented for the enumeration of directed-convex polyominos that are not parallelogram polyominoes and we establish that there are ( 2n n−2 ) with a perimeter of 2n + 4. Finally using known results we prove that there are ( 2n n ) directed-convex polyominos with a perimeter of 2n + 4.
متن کاملExcedances and Descents of Bi-increasing Permutations
Motivated by the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (socalled bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we give some combinatorial interpretatio...
متن کاملThe sandpile model on a bipartite graph, parallelogram polyominoes, and a q, t-Narayana polynomial
We give a polyomino characterisation of recurrent configurations of the sandpile model on the complete bipartite graph Km,n in which one designated vertex is the sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is a m× n rectangle. Other combinatorial structures appear in special cases of this correspondence: for example ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 20 شماره
صفحات -
تاریخ انتشار 1995